Solving Systems of Set Constraints with Negated Subset Relationships
نویسندگان
چکیده
W e present a decision procedure, based on tree automata techniques, for satisfiability of systems of set constraints including negated subset relationships. This result extends all previous works on set constraints solving (Heintze and Jaffar [HJ$Oa] ; Aiken and Wimmers [AW$2] ; Gilleron, Tison and Tommasi [GTT93a] ; Bachmair, Ganzinger and Waldmann [BG W$3]) and solves a problem which was left open an [BGW93]. W e prove in a constructive way that a non empty set of solutions always contains a regular solution, that i s a tuple of regular tree languages. Moreover, we think that the new class of tree automata described here could be interesting in i ts own.
منابع مشابه
Cockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملSOLVING MULTI CONSTRAINTS STRUCTURAL TOPOLOGY OPTIMIZATION PROBLEM WITH REFORMULATION OF LEVEL SET METHOD
Due to the favorable performance of structural topology optimization to create a proper understanding in the early stages of design, this issue is taken into consideration from the standpoint of research or industrial application in recent decades. Over the last three decades, several methods have been proposed for topology optimization. One of the methods that has been effectively used in stru...
متن کاملSolving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints
We extend previous results on the complexity of solving language equations with one-sided concatenation and all Boolean operations to the case where also disequations (i.e., negated equations) may occur. To show that solvability of systems of equations and disequations is still in ExpTime, we introduce a new type of automata working on infinite trees, which we call looping automata with colors....
متن کاملNumerical method for solving optimal control problem of the linear differential systems with inequality constraints
In this paper, an efficient method for solving optimal control problems of the linear differential systems with inequality constraint is proposed. By using new adjustment of hat basis functions and their operational matrices of integration, optimal control problem is reduced to an optimization problem. Also, the error analysis of the proposed method is nvestigated and it is proved that the orde...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کامل